An Efficient Quantum-Behaved Particle Swarm Optimization for Multiprocessor Scheduling
نویسندگان
چکیده
Quantum-behaved particle swarm optimization (QPSO) is employed to deal with multiprocessor scheduling problem (MSP), which speeds the convergence and has few parameters to control. We combine the QPSO search technique with list scheduling to improve the solution quality in short time. At the same time, we produce the solution based on the problem-space heuristic. Several benchmark instances are tested and the experiment results demonstrate much advantage of QPSO to some other heuristics in search ability and performance.
منابع مشابه
OPTIMUM SHAPE DESIGN OF DOUBLE-LAYER GRIDS BY QUANTUM BEHAVED PARTICLE SWARM OPTIMIZATION AND NEURAL NETWORKS
In this paper, a methodology is presented for optimum shape design of double-layer grids subject to gravity and earthquake loadings. The design variables are the number of divisions in two directions, the height between two layers and the cross-sectional areas of the structural elements. The objective function is the weight of the structure and the design constraints are some limitations on str...
متن کاملA Chaotic Quantum Behaved Particle Swarm Optimization Algorithm for Short-term Hydrothermal Scheduling
Abstract: This study proposes a novel chaotic quantum-behaved particle swarm optimization (CQPSO) algorithm for solving shortterm hydrothermal scheduling problem with a set of equality and inequality constraints. In the proposed method, chaotic local search technique is employed to enhance the local search capability and convergence rate of the algorithm. In addition, a novel constraint handlin...
متن کاملShort-term combined economic emission hydrothermal scheduling using improved quantum-behaved particle swarm optimization
This paper presents an improved quantum-behaved particle swarm optimization (IQPSO) for short-term combined economic emission hydrothermal scheduling, which is formulated as a bi-objective problem: (i) minimizing fuel cost and (ii) minimizing emission cost. In this paper, quantum-behaved particle swarm optimization is improved employing heuristic strategies in order to handle the equality const...
متن کاملA memetic algorithm combined particle swarm optimization with simulated annealing and its application on multiprocessor scheduling problem
A memetic algorithm, which combines globe search with local search strategies, is presented to deal with the multiprocessor scheduling problem(MSP). During the processes, an improved particle swarm optimization is employed to execute the globe search optimization, and the simulated annealing is adopted to improve the quality of the selected candidates based on a certain strategy. Simulations sh...
متن کاملImproved Particle Swarm Optimization for Solving Multiprocessor Scheduling Problem: Enhancements and Hybrid Methods
Memetic algorithms (MAs) are hybrid evolutionary algorithms (EAs) that combine global and local search by using an EA to perform exploration while the local search method performs exploitation. Combining global and local search is a strategy used by many successful global optimization approaches, and MAs have in fact been recognized as a powerful algorithmic paradigm for evolutionary computing....
متن کامل